Bounds on Non-surjective Cellular Automata

نویسندگان

  • Jarkko Kari
  • Pascal Vanier
  • Thomas Zeume
چکیده

Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of di erent words starting and ending identically and having the same image (diamonds) and words with more/fewer preimages than the average number (unbalanced words). Using a linear algebra approach, we obtain new upper bounds on the lengths of the shortest such objects. In the case of an n-state, non-surjective CA with neighborhood range 2 our bounds are of the orders O(n), O(n) and O(n) for the shortest orphan, diamond and unbalanced word, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An "almost dual" to Gottschalk's Conjecture

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injec...

متن کامل

Bounds for One-dimensional Cellular Automata: A Linear Algebraic Approach

In [CK05], E. Czeizler and J. Kari used a linear algebraic tool to obtain good upper bounds for the length of the inverse neighbourhood of reversible one-dimensional cellular automata (CA). Recently, a linear algebraic approach similar to the one used by J. Kari in [Kar03], lead to better upper bounds for the length of the shortest unbalanced words, shortest orphans and shortest diamonds of non...

متن کامل

Strictly Temporally Periodic Points in Cellular Automata

We study the set of strictly temporally periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but are not spatially periodic. This set turns out to be residual for equicontinuous surjective cellular automata, dense for almost equicontinuous surjective cellular automata, while it is empty for the positively expa...

متن کامل

Surjective multidimensional cellular automata are non-wandering: A combinatorial proof

A combinatorial proof that surjective D-dimensional CA are non-wandering is given. This answers an old open question stated in [3]. Moreover, an explicit upper–bound for the return time is given.

متن کامل

Post-surjectivity and balancedness of cellular automata over groups

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every preimage of one is asymptotic to a preimage of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injecti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009